Content-Controllable Summarization generates summaries focused on the given controlling signals. Due to the lack of large-scale training corpora for the task, we propose a plug-and-play module RelAttn to adapt any general summarizers to the content-controllable summarization task. RelAttn first identifies the relevant content in the source documents, and then makes the model attend to the right context by directly steering the attention weight. We further apply an unsupervised online adaptive parameter searching algorithm to determine the degree of control in the zero-shot setting, while such parameters are learned in the few-shot setting. By applying the module to three backbone summarization models, experiments show that our method effectively improves all the summarizers, and outperforms the prefix-based method and a widely used plug-and-play model in both zero- and few-shot settings. Tellingly, more benefit is observed in the scenarios when more control is needed.

The number of international benchmarking competitions is steadily increasing in various fields of machine learning (ML) research and practice. So far, however, little is known about the common practice as well as bottlenecks faced by the community in tackling the research questions posed. To shed light on the status quo of algorithm development in the specific field of biomedical imaging analysis, we designed an international survey that was issued to all participants of challenges conducted in conjunction with the IEEE ISBI 2021 and MICCAI 2021 conferences (80 competitions in total). The survey covered participants' expertise and working environments, their chosen strategies, as well as algorithm characteristics. A median of 72% challenge participants took part in the survey. According to our results, knowledge exchange was the primary incentive (70%) for participation, while the reception of prize money played only a minor role (16%). While a median of 80 working hours was spent on method development, a large portion of participants stated that they did not have enough time for method development (32%). 25% perceived the infrastructure to be a bottleneck. Overall, 94% of all solutions were deep learning-based. Of these, 84% were based on standard architectures. 43% of the respondents reported that the data samples (e.g., images) were too large to be processed at once. This was most commonly addressed by patch-based training (69%), downsampling (37%), and solving 3D analysis tasks as a series of 2D tasks. K-fold cross-validation on the training set was performed by only 37% of the participants and only 50% of the participants performed ensembling based on multiple identical models (61%) or heterogeneous models (39%). 48% of the respondents applied postprocessing steps.

Unit commitment (UC) are essential tools to transmission system operators for finding the most economical and feasible generation schedules and dispatch signals. Constraint screening has been receiving attention as it holds the promise for reducing a number of inactive or redundant constraints in the UC problem, so that the solution process of large scale UC problem can be accelerated by considering the reduced optimization problem. Standard constraint screening approach relies on optimizing over load and generations to find binding line flow constraints, yet the screening is conservative with a large percentage of constraints still reserved for the UC problem. In this paper, we propose a novel machine learning (ML) model to predict the most economical costs given load inputs. Such ML model bridges the cost perspectives of UC decisions to the optimization-based constraint screening model, and can screen out higher proportion of operational constraints. We verify the proposed method's performance on both sample-aware and sample-agnostic setting, and illustrate the proposed scheme can further reduce the computation time on a variety of setup for UC problems.

Image super-resolution is a common task on mobile and IoT devices, where one often needs to upscale and enhance low-resolution images and video frames. While numerous solutions have been proposed for this problem in the past, they are usually not compatible with low-power mobile NPUs having many computational and memory constraints. In this Mobile AI challenge, we address this problem and propose the participants to design an efficient quantized image super-resolution solution that can demonstrate a real-time performance on mobile NPUs. The participants were provided with the DIV2K dataset and trained INT8 models to do a high-quality 3X image upscaling. The runtime of all models was evaluated on the Synaptics VS680 Smart Home board with a dedicated edge NPU capable of accelerating quantized neural networks. All proposed solutions are fully compatible with the above NPU, demonstrating an up to 60 FPS rate when reconstructing Full HD resolution images. A detailed description of all models developed in the challenge is provided in this paper.

Precision-Recall曲线（AUPRC）下区域的随机优化是机器学习的关键问题。尽管已经对各种算法进行了广泛研究以进行AUPRC优化，但仅在多Query情况下保证了概括。在这项工作中，我们介绍了随机AUPRC优化的一次性概括中的第一个试验。对于更庞大的概括范围，我们专注于算法依赖性概括。我们目的地都有算法和理论障碍。从算法的角度来看，我们注意到，仅当采样策略偏见时，大多数现有随机估计器才会偏向，并且由于不可兼容性而不稳定。为了解决这些问题，我们提出了一个具有卓越稳定性的采样率不变的无偏随机估计器。最重要的是，AUPRC优化是作为组成优化问题配制的，并提出了随机算法来解决此问题。从理论的角度来看，算法依赖性概括分析的标准技术不能直接应用于这种列表的组成优化问题。为了填补这一空白，我们将模型稳定性从实例损失扩展到列表损失，并弥合相应的概括和稳定性。此外，我们构建状态过渡矩阵以描述稳定性的复发，并通过矩阵频谱简化计算。实际上，关于三个图像检索数据集的实验结果谈到了我们框架的有效性和健全性。

热分析在不同的温度场景下提供了对电子芯片行为的更深入见解，并可以更快地设计探索。但是，使用FEM或CFD，在芯片上获得详细而准确的热曲线非常耗时。因此，迫切需要加快片上热溶液以解决各种系统方案。在本文中，我们提出了一个热机学习（ML）求解器，以加快芯片的热模拟。热ML-Solver是最近的新型方法CoAemlSim（可组合自动编码器的机器学习模拟器）的扩展，并对溶液算法进行了修改，以处理常数和分布式HTC。在不同情况下，针对商业求解器（例如ANSYS MAPDL）以及最新的ML基线UNET验证了所提出的方法，以证明其增强的准确性，可伸缩性和概括性。

这项研究调查了基于知识的问题产生的任务（KBQG）。传统的KBQG的作品从知识图中的FACT三元组中产生了问题，该问题无法表达复杂的操作，例如SPARQL中的聚合和比较。此外，由于大规模SPARQL问题对的昂贵注释，因此需要急切地探索SPARQL的KBQG，因此需要急切地探索SPARQL。最近，由于通常接受自然语言（NL）至NL范式培训的生成预训练的语言模型（PLM）已被证明对低资源生成有效，例如T5和Bart，如何有效地利用它们来生成NL - 非NL SPARQL的问题是具有挑战性的。为了应对这些挑战，提出了AutoQGS是SPARQL低资源KBQG的自动推出方法。首先，我们提出要直接从SPARQL生成问题，以处理KBQG任务以处理复杂的操作。其次，我们提出了一个对大规模无监督数据训练的自动档案，以将SPARQL重新描述为NL描述，从而平滑了从非NL SPARQL到NL问题的低资源转换。 WebQuestionsSP，ComlexWebQuestions 1.1和路径问题的实验结果表明，我们的模型可实现最新的性能，尤其是在低资源设置中。此外，为进一步的KBQG研究生成了330k Factoid复杂问题-SPARQL对的语料库。

多模式学习，尤其是大规模的多模式预训练，在过去的几年中已经迅速发展，并带来了人工智能（AI）的最大进步。尽管具有有效性，但了解多模式预训练模型的潜在机制仍然是一个巨大的挑战。揭示此类模型的解释性可能会使AI领域中新型学习范式的突破。为此，鉴于人脑的多模式性质，我们建议借助非侵入性脑成像技术（例如功能磁共振成像（fMRI））探索多模式学习模型的解释性。具体而言，我们首先提出了1500万个图像文本对预训练的新设计的多模式基础模型，该模型在各种认知下游任务中显示出强烈的多模式理解和概括能力。此外，从神经编码的角度来看（基于我们的基础模型），我们发现，与单峰相比，经过多模式训练的视觉和舌编码器都更像脑状。特别是，我们确定了许多大脑区域，其中多模式训练的编码器表现出更好的神经编码性能。这与现有有关探索大脑多感觉整合的研究的发现是一致的。因此，我们认为，多模式基础模型是神经科学家研究人脑中多模式信号处理机制的更合适的工具。我们的发现还证明了多模式基础模型作为理想的计算模拟器的潜力，以促进脑和大脑的AI研究。

联合超分辨率和反音调映射（SR-ITM）旨在提高具有分辨率和动态范围具有质量缺陷的视频的视觉质量。当使用4K高动态范围（HDR）电视来观看低分辨率标准动态范围（LR SDR）视频时，就会出现此问题。以前依赖于学习本地信息的方法通常在保留颜色合规性和远程结构相似性方面做得很好，从而导致了不自然的色彩过渡和纹理伪像。为了应对这些挑战，我们建议联合SR-ITM的全球先验指导的调制网络（GPGMNET）。特别是，我们设计了一个全球先验提取模块（GPEM），以提取颜色合规性和结构相似性，分别对ITM和SR任务有益。为了进一步利用全球先验并保留空间信息，我们使用一些用于中间特征调制的参数，设计多个全球先验的指导空间调制块（GSMB），其中调制参数由共享的全局先验和空间特征生成来自空间金字塔卷积块（SPCB）的地图。通过这些精心设计的设计，GPGMNET可以通过较低的计算复杂性实现更高的视觉质量。广泛的实验表明，我们提出的GPGMNET优于最新方法。具体而言，我们提出的模型在PSNR中超过了0.64 dB的最新模型，其中69 $ \％$ $ $较少，3.1 $ \ times $ speedup。该代码将很快发布。

该技术报告介绍了MTVG的第三次获胜解决方案，这是在ACM MM 2022中的第4-人（PIC）挑战中引入的一项新任务。MTVG旨在根据文本拟定视频将步骤的时间边界定位在文本视频中描述。这项任务的最大挑战是化妆步骤的Fi ne Grean Video-Text语义。但是，当前方法主要使用基于动作的预训练模型提取视频功能。由于动作比化妆步骤更粗糙，因此基于动作的特征不足以提供提示。为了解决这个问题，我们建议通过利用特征多样性来实现Fi ne Grean的表示。具体而言，我们提出了一系列从特征提取，网络优化到模型集合的方法。结果，我们在MTVG比赛中获得了第三名。